Evidence Reliability in Nonmonotonic Domains and Nearly Monotonic Problems
نویسنده
چکیده
Many AI domains are nonmonotonic. The resulting uncertainty is often dealt with by associating degree-of-belief ratings (conditional probabilities) with propositions. However, in some domains, a key issue is determining the subset of the available data that the agent should process to use as the basis for making a decision about how to act. Since belief ratings provide no sense of their \re-liability" (if additional data were considered), they do not help an agent determine when suucient data has been considered. We believe that in many domains, there is a strong correlation between current belief and ultimate belief once some fraction of the available data has been processed. We call such problems nearly monotonic, and suggest that they are important in that they can support eecient satisscing problem solving. The content of the information does not necessarily reeect the position or the policy of the Government, and no oocial endorsement should be inferred.
منابع مشابه
Nearly Monotonic Problems: a Key to Eeective Fa/c Distributed Sensor Interpretation?
The functionally-accurate, cooperative (FA/C) distributed problem-solving paradigm is one approach for organizing distributed problem solving among homogeneous, cooperating agents. FA/C agents produce tentative, partial solutions based on only local information and then exchange these results, exploiting the constraints that exist among their local subproblems to resolve uncertainties and globa...
متن کاملLogic Programming for Non-Monotonic Reasoning
Our purpose is to exhibit a modular systematic method of representing nonmonotonic reasoning problems with the Well Founded Semantics of extended logic programs aumented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We show how to cast in the language of such logic programs forms of non-monotonic reasoning like defeasible reasoning and hypot...
متن کاملDynamic Diagnosis of Active Systems with Fragmented Observations
Diagnosis of discrete-event systems (DESs) is a complex and challenging task. Typical application domains include telecommunication networks, power networks, and digital-hardware networks. Recent blackouts in northern America and southern Europe offer evidence for the claim that automated diagnosis of large-scale DESs is a major requirement for the reliability of this sort of critical systems. ...
متن کاملEncoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational ee-ciency as our major consideration. In order to accomplish our goal, we bring together ideas from logic programming and the planning systems graphplan and satplan. We discuss diierent representations of planning problems in logic programs, point out issues related to their pe...
متن کاملNonmonotonic Reasoning Is Sometimes Simpler! 1
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of premises is P 2-complete. Similarly, we show that for a given formula ' and a set A of premises, it is P 2-complete to decide whether ' belongs to at least one S4-expansion for A, and it is P 2-complete to decide whether...
متن کامل